Checking Hybrid Automata for Linear Duration Invariants
نویسندگان
چکیده
In this paper, we consider the problem of checking hybrid systems modelled by hybrid automata for a class of real-time properties represented by linear duration invariants, which are constructed from linear inequalities of integrated durations of system states. Based on linear programming, an algorithm is developed for solving the problem for a class of hybrid automata.
منابع مشابه
Checking Linear Duration Invariants by Linear Programming
In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants 2] is addressed. We show that by linear programming, a particular class of timed automata including the class of real-time automata as a proper subset, can be checked for linear duration invariants. The so-called real-time regular expressions is introduced to expre...
متن کاملOn Checking Timed Automata for Linear Duration Invariants
In this work, we address the problem of verifying a Timed Automaton for a real-time property written in Duration Calculus in the form of Linear Duration Invariants. We present a conservative method for solving the problem using the linear programming techniques. First, we provide a procedure to translate Timed Automata to a sort of regular expressions for timed languages. Then, we extend the li...
متن کاملVerifying Linear Duration Constraints of Timed Automata
This report aims at developing a technique for checking if a timed automaton satisfies a linear duration constraint on the automaton states. The constraints are represented in the form of linear duration invariants a simple class of Chop-free Duration Calculus (DC) formulas. We prove that linear duration invariants of timed automata are discretisable, and reduce checking if a timed automaton sa...
متن کاملChecking Hybrid Automata for Linear Duration Invariants Checking Hybrid Automata for Linear Duration Invariants
UNU/IIST UNU/IIST enables developing countries to attain self-reliance in software technology by: (i) their own development of high integrity computing systems, (ii) highest level postgraduate university teaching, (iii) international level research, and, through the above, (iv) use of as sophisticated software as reasonable. UNU/IIST contributes through: (a) advanced, joint industry{university ...
متن کاملBounded Model Checking and Induction: From Refutation to Verification
We explore the combination of bounded model checking and induction for proving safety properties of infinite-state systems. In particular, we define a general k-induction scheme and prove completeness thereof. A main characteristic of our methodology is that strengthened invariants are generated from failed k-induction proofs. This strengthening step requires quantifier-elimination, and we prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997